Notes on Polynomially Bounded Arithmetic
نویسنده
چکیده
We characterize the collapse of Buss' bounded arithmetic in terms of the provable collapse of the polynomial time hierarchy. We include also some general model-theoretical investigations on fragments of bounded arithmetic.
منابع مشابه
Polynomial Arithmetic 3
(1) Many typos have been corrected (2) Some redoundancy has been eliminated Notes on polynomially bounded arithmetic Abstract We characterize the collapse of Buss' bounded arithmetic in terms of the prov-able collapse of the polynomial time hierarchy. We include also some general model-theoretical investigations on fragments of bounded arithmetic.
متن کاملPolynomially Bounded Recursive Realizability
A polynomially bounded recursive realizability, in which the recursive functions used in Kleene’s realizability are restricted to polynomially bounded functions, is introduced. It is used to show that provably total functions of Ruitenburg’s Basic Arithmetic are polynomially bounded (primitive) recursive functions. This sharpens our earlier result where those functions were proved to be primiti...
متن کاملPolynomially bounded solutions of the Loewner differential equation in several complex variables
We determine the form of polynomially bounded solutions to the Loewner differential equation that is satisfied by univalent subordination chains of the form $f(z,t)=e^{int_0^t A(tau){rm d}tau}z+cdots$, where $A:[0,infty]rightarrow L(mathbb{C}^n,mathbb{C}^n)$ is a locally Lebesgue integrable mapping and satisfying the condition $$sup_{sgeq0}int_0^inftyleft|expleft{int_s^t [A(tau)...
متن کاملBounding Quantification in Parametric Expansions of Presburger Arithmetic
Generalizing Cooper’s method of quantifier elimination for Presburger arithmetic, we give a new proof that all parametric Presburger families {St : t ∈ N} (as defined by Woods in [8]) are definable by formulas with polynomially bounded quantifiers in an expanded language with predicates for divisibility by f(t) for every polynomial f ∈ Z[t]. In fact, this quantifier bounding method works more g...
متن کاملDiscrepancy of Sums of Three Arithmetic Progressions
The set system of all arithmetic progressions on [n] is known to have a discrepancy of order n1/4. We investigate the discrepancy for the set system S3 n formed by all sums of three arithmetic progressions on [n] and show that the discrepancy of S3 n is bounded below by Ω(n1/2). Thus S3 n is one of the few explicit examples of systems with polynomially many sets and a discrepancy this high.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 61 شماره
صفحات -
تاریخ انتشار 1996